Efficient Handling of Positional Predicates Within XML Query Processing

نویسندگان

  • Zografoula Vagena
  • Nick Koudas
  • Divesh Srivastava
  • Vassilis J. Tsotras
چکیده

The inherent order within the XML document-centric data model is typically exposed through positional predicates defined over the XPath navigation axes. Although processing algorithms for each axis have already been proposed, the incorporation of positional predicates in them has received very little attention. In this paper, we present techniques that leverage the power of existing, state of the art methods, to efficiently support positional predicates as well. Our preliminary experimental comparisons with alternative approaches reveal the performance benefits of the proposed techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AB-Index: An Efficient Adaptive Index for Branching XML Queries

Query-adaptive XML indexing has been proposed and shown to be an efficient way to accelerate XML query processing, because it dynamically adapts to the workload. However, existing adaptive index lack of support for branching queries, and also with low efficiency for query processing and adaptation operations. In this paper, we propose a new Adaptive index for Branching queries, which is named a...

متن کامل

Efficient probabilistic XML query processing using an extended labeling scheme and a lightweight index

Recently there is a growing interest in the data model and query processing for probabilistic XML data. There are many potential applications of probabilistic data, and the XML data model is suitable to represent hierarchical information and data uncertainty of different levels naturally. However, the previously proposed probabilistic XML data models and query processing techniques separate fin...

متن کامل

TwigStackList-: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data

As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called Twig...

متن کامل

Locating XML Documents Using Content and Structure Synopses

In this paper, we present a novel framework for locating schema-less XML documents based on concise data synopses extracted from the documents. We introduce two novel data synopses, content synopsis and positional filter, to summarize the text data in an XML document for the query evaluation. These two data synopses correlate textual with positional information and consider the containment rela...

متن کامل

Relaxing XML Preference Queries for Cooperative Retrieval

Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been thoroughly researched. But given the ever growing amount of information available in different sources, also querying becomes more complex. In contrast to simple exact match retrieval, approximate matches become far m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005